Finer Garbage Collection in Lindacap
نویسندگان
چکیده
As open systems persist, garbage collection (GC) can be a vital aspect in managing system resources. Although garbage collection has been proposed for the standard Linda, it was a rather course-grained mechanism. This finer-grained method is offered in Lindacap, a capability-based coordination system for open distributed systems. Multicapabilities in Lindacap enable tuples to be uniquely referenced, thus providing sufficient information on the usability of tuples (data) within the tuple-space. This paper describes the garbage collection mechanism deployed in Lindacap, which involves selectively garbage collecting tuples within tuple-spaces. The authors present the approach using reference counting, followed by the tracing (mark-and-sweep) algorithm to garbage collect cyclic structures. A time-to-idle (TTI) technique is also proposed, which allows for garbage collection of multicapability regions that are being referred to by agents but are not used in a specified length of time. The performance results indicate that the incorporation of garbage collection techniques adds little overhead to the overall performance of the system. The difference between the average overhead caused by the mark-and-sweep and reference counting is small, and can be considered insignificant if the benefits brought by the markand-sweep is taken into account. DOI: 10.4018/978-1-4666-0023-2.ch007
منابع مشابه
Information Integration on Web-based Applications and Services
This issue contains five extended papers from the 11th International Conference on Information Integration and Web-based Applications and Services (iiWAS2009), which has been collocated with the 7th International Conference on Advances in Mobile Computing & Multimedia (MoMM2009) held in Kuala Lumpur, Malaysia in December 2009. Almost 200 papers have been presented at these two conferences, out ...
متن کاملSemi-Automatic Garbage Collection for Mobile Networks
Mobile networks pose new issues in the field of distributed garbage collection. Garbage collection must deal with volatile connections that may break remote object references unexpectedly for an unpredictable amount of time. As a result, no automatic distributed garbage collection satisfies the new hardware phenomena. A semantic-based approach called semi-automatic garbage collection is propose...
متن کاملProviding hints for garbage collection
This paper presents a mechanism that uses off-line profile information to examine when garbage is best collected. This information is then used to guide the garbage collection frequency in order to reduce the garbage collection time and total execution time. Keywords—Java, garbage collection, scheduling
متن کاملNREVERSAL of Fortune - The Thermodynamics of Garbage Collection
The need to reverse a computation arises in many contexts—debugging, editor undoing, optimistic concurrency undoing, speculative computation undoing, trace scheduling, exception handling undoing, database recovery, optimistic discrete event simulations, subjunctive computing, etc. The need to analyze a reversed computation arises in the context of static analysis—liveness analysis, strictness a...
متن کاملAutonomous Garbage Collection: Resolve Memory Leaks In Long Running Server Applications
We demonstrate the benefits of a garbage collection technique that requires neither programmer assistance or rebuilding (compiling or linking) of target applications. Thus, it effectively mitigates performance degeneration due to memory leaks in applications when source code and object code is not available. Our technique is an extension of the garbage collection method known as conservative ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJITWE
دوره 5 شماره
صفحات -
تاریخ انتشار 2010